Impossibility of secure two-party classical computation
نویسندگان
چکیده
منابع مشابه
The Impossibility Of Secure Two-Party Classical Computation
Consider two parties wishing to compute some joint function of their data (two millionaires might wish to know who is richer, for example). A secure computation of such a function is one for which the only information the first party gets on the input of the second is that implied by the outcome of the computation, and vice versa. In this work, we focus on unconditional security, whereby we see...
متن کاملFair Secure Two-Party Computation
We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol prematurely. The transformation adds additional steps before and after the execution of the original protocol, but does not change it otherwise, and does not use a trusted third party. It is based on the use of g...
متن کاملOn Secure Two-party Computation
1.1. Secure Two-Party Computation. In essence, secure multiparty computation is the solution to the problem how to compute on private inputs from several parties when we do not trust other parties and we don’t have a central authority who can get inputs, perform computations and give outputs to those that need them. Here we will talk about secure twoparty computation, where Alice, holding xa an...
متن کاملSecrecy of Two-Party Secure Computation
Privacy protection has become one of the most important issues in the information era. Thus, many protocols have been developed to achieve the goal of cooperatively accomplishing a computational task without revealing the participants’ private data. Practical protocols, however, do not guarantee perfect privacy protection, as some degree of privacy leakage is allowed during the computation proc...
متن کاملEfficiently Making Secure Two-Party Computation Fair
Secure two-party computation cannot be fair against malicious adversaries, unless a trusted third party (TTP) or a gradual-release type super-constant round protocol is employed. Existing optimistic fair two-party computation protocols with constant rounds are either too costly to arbitrate (e.g., the TTP may need to re-do almost the whole computation), or require the use of electronic payments...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2007
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.76.062308